Model Checking Markov Chains Using Krylov Subspace Methods: An Experience Report
نویسندگان
چکیده
The predominant technique for computing the transient distribution of a Continuous Time Markov Chain (CTMC) exploits uniformization, which is known to be stable and efficient for non-stiff to mildly-stiff CTMCs. On stiff CTMCs however, uniformization suffers from severe performance degradation. In this paper, we report on our observations and analysis of an alternative technique using Krylov subspaces. We implemented a Krylov-based extension to MRMC (Markov Reward Model Checker) and conducted extensive experiments on five case studies from different application domains. The results reveal that the Krylov-based technique is an order of magnitude faster on stiff CTMCs.
منابع مشابه
2nd International Workshop on the Numerical Solution of Markov Chains 1 Preconditioned Krylov Subspace Methods for the Numerical Solution of Markov Chains
In a general projection technique the original matrix problem of size N is approximated by one of dimension m, typically much smaller than N. A particularly successful class of techniques based on this principle is that of Krylov subspace methods which utilize subspaces of the form spanfv; Av; ::::;A m?1 vg. This general principle can be used to solve linear systems and eigenvalue problems whic...
متن کاملA Parallel Solver for Large-Scale Markov Chains
We consider the parallel computation of the stationary probability distribution vector of ergodic Markov chains with large state spaces by preconditioned Krylov subspace methods. The parallel preconditioner is obtained as an explicit approximation, in factorized form, of a particular generalized inverse of the innnitesimal generator of the Markov process. Conditions that guarantee the existence...
متن کاملBlock Triangular Preconditioners for -matrices and Markov Chains
BLOCK TRIANGULAR PRECONDITIONERS FOR -MATRICES AND MARKOV CHAINS MICHELE BENZI AND BORA UÇAR Abstract. We consider preconditioned Krylov subspace methods for solving large sparse linear systems under the assumption that the coefficient matrix is a (possibly singular) -matrix. The matrices are partitioned into block form using graph partitioning. Approximations to the Schur complement are used t...
متن کاملBlock Triangular Preconditioners for M-matrices and Markov Chains
We consider preconditioned Krylov subspace methods for solving large sparse linear systems under the assumption that the coefficient matrix is a (possibly singular) M -matrix. The matrices are partitioned into 2×2 block form using graph partitioning. Approximations to the Schur complement are used to produce various preconditioners of block triangular and block diagonal type. A few properties o...
متن کاملPii: S0168-9274(01)00116-7
We consider the parallel computation of the stationary probability distribution vector of ergodic Markov chains with large state spaces by preconditioned Krylov subspace methods. The parallel preconditioner is obtained as an explicit approximation, in factorized form, of a particular generalized inverse of the generator matrix of the Markov process. Graph partitioning is used to parallelize the...
متن کامل